Fixed point characterization of infinite behavior of finite-state systems
نویسندگان
چکیده
منابع مشابه
Fixed Point Characterization of Infinite Behavior of Finite-State Systems
Innnite behavior of nondeterministic nite state automata running over innnite trees or more generally over elements of an arbitrary algebraic structure is characterized by a calculus of xed point terms interpreted in powerset algebras. These terms involve the least and greatest xed point operators and disjunction as the only logical operation. A tight correspondence is established between a hie...
متن کاملExtreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space
We study infinite-horizon nonstationary Markov decision processes with discounted cost criterion, finite state space, and side constraints. This problem can equivalently be formulated as a countably infinite linear program (CILP), a linear program with countably infinite number of variables and constraints. We provide a complete algebraic characterization of extreme points of the CILP formulati...
متن کاملInfinite groups with fixed point properties
We construct finitely generated groups with strong fixed point properties. Let Xac be the class of Hausdorff spaces of finite covering dimension which are mod-p acyclic for at least one prime p. We produce the first examples of infinite finitely generated groups Q with the property that for any action of Q on any X ∈ Xac, there is a global fixed point. Moreover, Q may be chosen to be simple and...
متن کاملFixed Point Iterations Using Infinite Matrices
Let £ be a closed, bounded, convex subset of a Banach space X, /: E —»E. Consider the iteration scheme defined by x"« = xQ e E, x , = ñx ), x = 2" na ,x., nal, where A is a regular weighted mean n + l ' n n * = 0 nk k o er matrix. For particular spaces X and functions /we show that this iterative scheme converges to a fixed point of /. Let X be a normed linear space, E a nonempty closed bounded...
متن کاملFixed Point of the Finite System DMRG
The density matrix renormalization group (DMRG) is a numerical method that optimizes a variational state expressed by a tensor product. We show that the ground state is not fully optimized as far as we use the standard finite system algorithm, that uses the block structure B • •B. This is because the tensors are not improved directly. We overcome this problem by using the simpler block structur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00039-x